$3 \times 3$ minors of catalecticants

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3× 3 Minors of Catalecticants

Secant varieties to Veronese embeddings of projective space are classical varieties whose equations are not completely understood. Minors of catalecticant matrices furnish some of their equations, and in some situations even generate their ideals. Geramita conjectured that this is the case for the secant line variety of the Veronese variety, namely that its ideal is generated by the 3×3 minors ...

متن کامل

Excluded Minors for [ 2 , 3 ] - Graph Planarity

A Kuratowski-type approach for [2,3]-graphs, i.e. hypergraphs the cardinality of whose edges not more than 3, is presented, leading to a well-quasi-order in such a context, with a complete obstruction set of six forbidden hypergraphs to plane embedding. A Kuratowski-type result is presented for finite hypergraphs, the cardinality of whose edges is not more than 3. Motivation goes back to [1, 2]...

متن کامل

On Forbidden Minors for Gp(3)

A new, surprisingly simple proof is given of the finiteness of the set of matroids minor-minimally not representable over GF(3). It is, in fact, proved that every such matroid has rank or corank at most 3. Introduction. For q a prime power we denote by C(q) the class of matroids representable over GF(q), and by T(q) the class of matroids which are minorminimally not in £(q). It was conjectured ...

متن کامل

Decomposing infinite matroids into their 3-connected minors

s Elgersburg 2011 Rainbow Cycles in Cube Graphs Jens-P. Bode (Technische Universität Braunschweig) Joint work with A. Kemnitz and S. Struckmann A graph G is called rainbow with respect to an edge coloring if no two edges of G have the same color. Given a host graph H and a guest graph G ⊆ H, an edge coloring of H is called G-anti-Ramsey if no subgraph of H isomorphic to G is rainbow. The anti-R...

متن کامل

Capturing matroid elements in unavoidable 3-connected minors

A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connectedmatroidM has unavoidable structure. For everyn > 2, there is an integer f (n) so that if |E(M)| > f (n), thenM has aminor isomorphic to the rank-n wheel or whirl, a rank-n spike, the cycle or bond matroid of K3,n, or U2,n or Un−2,n. In this paper, we build on this result to determine what can be said about a large ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Research Letters

سال: 2013

ISSN: 1073-2780,1945-001X

DOI: 10.4310/mrl.2013.v20.n4.a10